recursive family

См. также в других словарях:

• Recursive tree — In graph theory, a discipline within mathematics, a recursive tree is a non planar labeled rooted tree. A size n recursive tree is labeled by distinct integers 1, 2, ..., n , where the labels are strictly increasing starting at the root labeled 1 …   Wikipedia

• Recursive join — The recursive join is an operation used in relational databases, also sometimes called a fixed point join . It is a compound operation that involves repeating the join operation, typically accumulating more records each time, until a repetition… …   Wikipedia

• Abstract family of languages — An abstract family of languages is a grouping of formal languages such that the membership of a language in a given family is proven by its sharing of specific characteristics with the languages already known to be of that family. A family must… …   Wikipedia

• Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

• metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… …   Universalium

• Definition — For other uses, see Definition (disambiguation). A definition is a passage that explains the meaning of a term (a word, phrase or other set of symbols), or a type of thing. The term to be defined is the definiendum. A term may have many different …   Wikipedia

• Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… …   Wikipedia

• automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… …   Universalium

• Ludwig Wittgenstein — Wittgenstein redirects here. For other uses, see Wittgenstein (disambiguation). Ludwig Wittgenstein Photographed by Ben Richards Swansea, Wales, 1947 Born 26 April 1889 …   Wikipedia

• Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… …   Wikipedia

• Scale space implementation — Scale space Scale space axioms Scale space implementation Feature detection Edge detection Blob detection Corner detection …   Wikipedia